#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],mx1[maxn],mx2[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n;cin>>n;
  for(LL i=1;i<=n;i++) cin>>a[i];
  for(LL i=1;i<=n;i++){
     if(mx1[i-1]<=a[i]){
        mx2[i]=mx1[i-1];
        mx1[i]=a[i];
     }
     else if(mx2[i-1]<a[i]){
        mx2[i]=a[i];
        mx1[i]=mx1[i-1];
     }
     else mx2[i]=mx2[i-1],mx1[i]=mx1[i-1];
  }
  LL q;cin>>q;
  for(LL i=1;i<=q;i++){
    LL x;cin>>x;
    cout<<mx2[x]<<"\n";
  }
return 0;
}
